0.03/0.13	% Problem    : Vampire---4.8_24075 : TPTP v0.0.0. Released v0.0.0.
0.14/0.14	% Command    : run_E %s %d THM
0.14/0.35	% Computer : n012.cluster.edu
0.14/0.35	% Model    : x86_64 x86_64
0.14/0.35	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.35	% Memory   : 8042.1875MB
0.14/0.35	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.35	% CPULimit   : 1440
0.14/0.35	% WCLimit    : 180
0.14/0.35	% DateTime   : Mon Jul  3 13:05:37 EDT 2023
0.14/0.35	% CPUTime    : 
0.20/0.49	Running higher-order theorem provingRunning: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075
0.20/0.49	# Version: 3.1pre001-ho
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.51	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.51	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.51	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.51	# Starting post_as_ho1 with 180s (1) cores
0.20/0.51	# post_as_ho1 with pid 24422 completed with status 0
0.20/0.51	# Result found by post_as_ho1
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.51	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.51	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.51	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.51	# Starting post_as_ho1 with 180s (1) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHSF-FFSS00-SHSSMFNN
0.20/0.51	# partial match(1): HGHNF-FFSS00-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.51	# Starting new_ho_10 with 98s (1) cores
0.20/0.51	# new_ho_10 with pid 24424 completed with status 0
0.20/0.51	# Result found by new_ho_10
0.20/0.51	# Preprocessing class: HSMSSMSSMLMNHSN.
0.20/0.51	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.20/0.51	# Starting ho_unfolding_3 with 900s (5) cores
0.20/0.51	# Starting ehoh_best2_full_lfho with 180s (1) cores
0.20/0.51	# Starting almost_fo_3_lam with 180s (1) cores
0.20/0.51	# Starting post_as_ho1 with 180s (1) cores
0.20/0.51	# No SInE strategy applied
0.20/0.51	# Search class: HGHSF-FFSS00-SHSSMFNN
0.20/0.51	# partial match(1): HGHNF-FFSS00-SHSSMFNN
0.20/0.51	# Scheduled 6 strats onto 1 cores with 180 seconds (180 total)
0.20/0.51	# Starting new_ho_10 with 98s (1) cores
0.20/0.51	# Preprocessing time       : 0.002 s
0.20/0.51	# Presaturation interreduction done
0.20/0.51	
0.20/0.51	# Proof found!
0.20/0.51	# SZS status Theorem
0.20/0.51	# SZS output start CNFRefutation
0.20/0.51	thf(decl_27, type, refl: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_31, type, antisymm: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_32, type, asymm: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_34, type, trans: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_38, type, po: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_39, type, so: ($i > $i > $o) > $o).
0.20/0.51	thf(decl_51, type, epred1_0: $i > $i > $o).
0.20/0.51	thf(decl_52, type, esk1_0: $i).
0.20/0.51	thf(decl_53, type, esk2_0: $i).
0.20/0.51	thf(decl_54, type, esk3_0: $i).
0.20/0.51	thf(decl_55, type, esk4_0: $i).
0.20/0.51	thf(decl_56, type, esk5_0: $i).
0.20/0.51	thf(partial_order, axiom, ((po)=(^[X1:$i > $i > $o]:((((refl @ X1)&(antisymm @ X1))&(trans @ X1))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', partial_order)).
0.20/0.51	thf(reflexive, axiom, ((refl)=(^[X1:$i > $i > $o]:(![X3:$i]:((X1 @ X3 @ X3))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', reflexive)).
0.20/0.51	thf(antisymmetric, axiom, ((antisymm)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X3))=>((X3)=(X4))))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', antisymmetric)).
0.20/0.51	thf(transitive, axiom, ((trans)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((X1 @ X3 @ X4)&(X1 @ X4 @ X6))=>(X1 @ X3 @ X6)))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', transitive)).
0.20/0.51	thf(strict_order, axiom, ((so)=(^[X1:$i > $i > $o]:(((asymm @ X1)&(trans @ X1))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', strict_order)).
0.20/0.51	thf(asymmetric, axiom, ((asymm)=(^[X1:$i > $i > $o]:(![X3:$i, X4:$i]:(((X1 @ X3 @ X4)=>~((X1 @ X4 @ X3))))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', asymmetric)).
0.20/0.51	thf(partial_order_induces_strict_order, conjecture, ![X1:$i > $i > $o]:(((po @ X1)=>(so @ (^[X3:$i, X4:$i]:(((X1 @ X3 @ X4)&((X3)!=(X4)))))))), file('/export/starexec/sandbox/tmp/tmp.I1EtLdDiXN/Vampire---4.8_24075', partial_order_induces_strict_order)).
0.20/0.51	thf(c_0_7, plain, ((po)=(^[Z0/* 8 */:$i > $i > $o]:((((![X33:$i]:((Z0 @ X33 @ X33)))&(![X34:$i, X35:$i]:((((Z0 @ X34 @ X35)&(Z0 @ X35 @ X34))=>((X34)=(X35))))))&(![X36:$i, X37:$i, X38:$i]:((((Z0 @ X36 @ X37)&(Z0 @ X37 @ X38))=>(Z0 @ X36 @ X38)))))))), inference(fof_simplification,[status(thm)],[partial_order])).
0.20/0.51	thf(c_0_8, plain, ((refl)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i]:((Z0 @ X3 @ X3))))), inference(fof_simplification,[status(thm)],[reflexive])).
0.20/0.51	thf(c_0_9, plain, ((antisymm)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i]:((((Z0 @ X3 @ X4)&(Z0 @ X4 @ X3))=>((X3)=(X4))))))), inference(fof_simplification,[status(thm)],[antisymmetric])).
0.20/0.51	thf(c_0_10, plain, ((trans)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i, X6:$i]:((((Z0 @ X3 @ X4)&(Z0 @ X4 @ X6))=>(Z0 @ X3 @ X6)))))), inference(fof_simplification,[status(thm)],[transitive])).
0.20/0.51	thf(c_0_11, plain, ((so)=(^[Z0/* 8 */:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(fof_simplification,[status(thm)],[strict_order])).
0.20/0.51	thf(c_0_12, plain, ((asymm)=(^[Z0/* 6 */:$i > $i > $o]:(![X3:$i, X4:$i]:(((Z0 @ X3 @ X4)=>~((Z0 @ X4 @ X3))))))), inference(fof_simplification,[status(thm)],[asymmetric])).
0.20/0.51	thf(c_0_13, plain, ((po)=(^[Z0/* 8 */:$i > $i > $o]:((((![X33:$i]:((Z0 @ X33 @ X33)))&(![X34:$i, X35:$i]:((((Z0 @ X34 @ X35)&(Z0 @ X35 @ X34))=>((X34)=(X35))))))&(![X36:$i, X37:$i, X38:$i]:((((Z0 @ X36 @ X37)&(Z0 @ X37 @ X38))=>(Z0 @ X36 @ X38)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_7, c_0_8]), c_0_9]), c_0_10])).
0.20/0.51	thf(c_0_14, plain, ((so)=(^[Z0/* 8 */:$i > $i > $o]:(((![X39:$i, X40:$i]:(((Z0 @ X39 @ X40)=>~((Z0 @ X40 @ X39)))))&(![X41:$i, X42:$i, X43:$i]:((((Z0 @ X41 @ X42)&(Z0 @ X42 @ X43))=>(Z0 @ X41 @ X43)))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_11, c_0_12]), c_0_10])).
0.20/0.51	thf(c_0_15, negated_conjecture, ~(![X1:$i > $i > $o]:((((![X158:$i]:((X1 @ X158 @ X158))&![X159:$i, X160:$i]:((((X1 @ X159 @ X160)&(X1 @ X160 @ X159))=>((X159)=(X160)))))&![X161:$i, X162:$i, X163:$i]:((((X1 @ X161 @ X162)&(X1 @ X162 @ X163))=>(X1 @ X161 @ X163))))=>(![X164:$i, X165:$i]:((((X1 @ X164 @ X165)&((X164)!=(X165)))=>~(((X1 @ X165 @ X164)&((X165)!=(X164))))))&![X166:$i, X167:$i, X168:$i]:(((((X1 @ X166 @ X167)&((X166)!=(X167)))&((X1 @ X167 @ X168)&((X167)!=(X168))))=>((X1 @ X166 @ X168)&((X166)!=(X168))))))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[partial_order_induces_strict_order])]), c_0_13]), c_0_14])).
0.20/0.51	thf(c_0_16, negated_conjecture, ![X170:$i, X171:$i, X172:$i, X173:$i, X174:$i, X175:$i]:(((((epred1_0 @ X170 @ X170)&(~(epred1_0 @ X171 @ X172)|~(epred1_0 @ X172 @ X171)|((X171)=(X172))))&(~(epred1_0 @ X173 @ X174)|~(epred1_0 @ X174 @ X175)|(epred1_0 @ X173 @ X175)))&(((((((epred1_0 @ esk3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0))&(((esk3_0)!=(esk4_0))|(epred1_0 @ esk1_0 @ esk2_0)))&(((epred1_0 @ esk4_0 @ esk5_0)|(epred1_0 @ esk1_0 @ esk2_0))&(((esk4_0)!=(esk5_0))|(epred1_0 @ esk1_0 @ esk2_0))))&(~(epred1_0 @ esk3_0 @ esk5_0)|((esk3_0)=(esk5_0))|(epred1_0 @ esk1_0 @ esk2_0)))&(((((epred1_0 @ esk3_0 @ esk4_0)|((esk1_0)!=(esk2_0)))&(((esk3_0)!=(esk4_0))|((esk1_0)!=(esk2_0))))&(((epred1_0 @ esk4_0 @ esk5_0)|((esk1_0)!=(esk2_0)))&(((esk4_0)!=(esk5_0))|((esk1_0)!=(esk2_0)))))&(~(epred1_0 @ esk3_0 @ esk5_0)|((esk3_0)=(esk5_0))|((esk1_0)!=(esk2_0)))))&((((((epred1_0 @ esk3_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0))&(((esk3_0)!=(esk4_0))|(epred1_0 @ esk2_0 @ esk1_0)))&(((epred1_0 @ esk4_0 @ esk5_0)|(epred1_0 @ esk2_0 @ esk1_0))&(((esk4_0)!=(esk5_0))|(epred1_0 @ esk2_0 @ esk1_0))))&(~(epred1_0 @ esk3_0 @ esk5_0)|((esk3_0)=(esk5_0))|(epred1_0 @ esk2_0 @ esk1_0)))&(((((epred1_0 @ esk3_0 @ esk4_0)|((esk2_0)!=(esk1_0)))&(((esk3_0)!=(esk4_0))|((esk2_0)!=(esk1_0))))&(((epred1_0 @ esk4_0 @ esk5_0)|((esk2_0)!=(esk1_0)))&(((esk4_0)!=(esk5_0))|((esk2_0)!=(esk1_0)))))&(~(epred1_0 @ esk3_0 @ esk5_0)|((esk3_0)=(esk5_0))|((esk2_0)!=(esk1_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])])])).
0.20/0.51	thf(c_0_17, negated_conjecture, ![X3:$i, X4:$i, X6:$i]:(((epred1_0 @ X3 @ X6)|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X6)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_18, negated_conjecture, ((epred1_0 @ esk4_0 @ esk5_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_19, negated_conjecture, ((epred1_0 @ esk4_0 @ esk5_0)|((esk2_0)!=(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_20, negated_conjecture, ![X3:$i]:(((epred1_0 @ esk1_0 @ esk2_0)|(epred1_0 @ X3 @ esk5_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_17, c_0_18])).
0.20/0.51	thf(c_0_21, negated_conjecture, ((epred1_0 @ esk3_0 @ esk4_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_22, negated_conjecture, (((esk3_0)=(esk5_0))|~((epred1_0 @ esk3_0 @ esk5_0))|((esk2_0)!=(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_23, negated_conjecture, ![X3:$i]:(((epred1_0 @ X3 @ esk5_0)|((esk2_0)!=(esk1_0))|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_17, c_0_19])).
0.20/0.51	thf(c_0_24, negated_conjecture, ((epred1_0 @ esk3_0 @ esk4_0)|((esk2_0)!=(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_25, negated_conjecture, ![X4:$i, X3:$i]:((((X3)=(X4))|~((epred1_0 @ X3 @ X4))|~((epred1_0 @ X4 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_26, negated_conjecture, (((esk3_0)!=(esk4_0))|((esk2_0)!=(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_27, negated_conjecture, ((epred1_0 @ esk4_0 @ esk5_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_28, negated_conjecture, (((esk3_0)=(esk5_0))|(epred1_0 @ esk1_0 @ esk2_0)|~((epred1_0 @ esk3_0 @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_29, negated_conjecture, ((epred1_0 @ esk3_0 @ esk5_0)|(epred1_0 @ esk1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_20, c_0_21])).
0.20/0.51	thf(c_0_30, negated_conjecture, (((esk5_0)=(esk3_0))|((esk2_0)!=(esk1_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22, c_0_23]), c_0_24])).
0.20/0.51	thf(c_0_31, negated_conjecture, (((esk2_0)!=(esk1_0))|~((epred1_0 @ esk4_0 @ esk3_0))), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_24]), c_0_26])).
0.20/0.51	thf(c_0_32, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|((esk4_0)!=(esk5_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_33, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|((esk4_0)!=(esk5_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_34, negated_conjecture, (((esk4_0)!=(esk5_0))|((esk2_0)!=(esk1_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_35, negated_conjecture, ![X3:$i]:(((epred1_0 @ esk2_0 @ esk1_0)|(epred1_0 @ X3 @ esk5_0)|~((epred1_0 @ X3 @ esk4_0)))), inference(spm,[status(thm)],[c_0_17, c_0_27])).
0.20/0.51	thf(c_0_36, negated_conjecture, ((epred1_0 @ esk3_0 @ esk4_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_37, negated_conjecture, (((esk5_0)=(esk3_0))|(epred1_0 @ esk1_0 @ esk2_0)), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.20/0.51	thf(c_0_38, negated_conjecture, ((esk2_0)!=(esk1_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19, c_0_30]), c_0_31])).
0.20/0.51	thf(c_0_39, negated_conjecture, ((esk5_0)!=(esk4_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_32]), c_0_33]), c_0_34])).
0.20/0.51	thf(c_0_40, negated_conjecture, (((esk3_0)=(esk5_0))|(epred1_0 @ esk2_0 @ esk1_0)|~((epred1_0 @ esk3_0 @ esk5_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_41, negated_conjecture, ((epred1_0 @ esk3_0 @ esk5_0)|(epred1_0 @ esk2_0 @ esk1_0)), inference(spm,[status(thm)],[c_0_35, c_0_36])).
0.20/0.51	thf(c_0_42, negated_conjecture, (((esk5_0)=(esk3_0))|~((epred1_0 @ esk2_0 @ esk1_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_37]), c_0_38])).
0.20/0.51	thf(c_0_43, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|~((epred1_0 @ esk5_0 @ esk4_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_27]), c_0_39])).
0.20/0.51	thf(c_0_44, negated_conjecture, ((esk5_0)=(esk3_0)), inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40, c_0_41]), c_0_42])).
0.20/0.51	thf(c_0_45, negated_conjecture, ((epred1_0 @ esk2_0 @ esk1_0)|((esk3_0)!=(esk4_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_46, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|((esk3_0)!=(esk4_0))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.20/0.51	thf(c_0_47, negated_conjecture, (epred1_0 @ esk2_0 @ esk1_0), inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_43, c_0_44]), c_0_36])).
0.20/0.51	thf(c_0_48, negated_conjecture, ((esk4_0)!=(esk3_0)), inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_45]), c_0_46]), c_0_26])).
0.20/0.51	thf(c_0_49, negated_conjecture, ~((epred1_0 @ esk1_0 @ esk2_0)), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_47]), c_0_38])).
0.20/0.51	thf(c_0_50, negated_conjecture, ((epred1_0 @ esk1_0 @ esk2_0)|~((epred1_0 @ esk4_0 @ esk3_0))), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_25, c_0_21]), c_0_48])).
0.20/0.51	thf(c_0_51, negated_conjecture, (epred1_0 @ esk4_0 @ esk3_0), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_44]), c_0_49])).
0.20/0.51	thf(c_0_52, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50, c_0_51])]), c_0_49]), ['proof']).
0.20/0.51	# SZS output end CNFRefutation
0.20/0.51	# Parsed axioms                        : 59
0.20/0.51	# Removed by relevancy pruning/SinE    : 0
0.20/0.51	# Initial clauses                      : 52
0.20/0.51	# Removed in clause preprocessing      : 29
0.20/0.51	# Initial clauses in saturation        : 23
0.20/0.51	# Processed clauses                    : 76
0.20/0.51	# ...of these trivial                  : 1
0.20/0.51	# ...subsumed                          : 13
0.20/0.51	# ...remaining for further processing  : 62
0.20/0.51	# Other redundant clauses eliminated   : 0
0.20/0.51	# Clauses deleted for lack of memory   : 0
0.20/0.51	# Backward-subsumed                    : 15
0.20/0.51	# Backward-rewritten                   : 17
0.20/0.51	# Generated clauses                    : 67
0.20/0.51	# ...of the previous two non-redundant : 70
0.20/0.51	# ...aggressively subsumed             : 0
0.20/0.51	# Contextual simplify-reflections      : 10
0.20/0.51	# Paramodulations                      : 66
0.20/0.51	# Factorizations                       : 0
0.20/0.51	# NegExts                              : 0
0.20/0.51	# Equation resolutions                 : 0
0.20/0.51	# Total rewrite steps                  : 22
0.20/0.51	# Propositional unsat checks           : 0
0.20/0.51	#    Propositional check models        : 0
0.20/0.51	#    Propositional check unsatisfiable : 0
0.20/0.51	#    Propositional clauses             : 0
0.20/0.51	#    Propositional clauses after purity: 0
0.20/0.51	#    Propositional unsat core size     : 0
0.20/0.51	#    Propositional preprocessing time  : 0.000
0.20/0.51	#    Propositional encoding time       : 0.000
0.20/0.51	#    Propositional solver time         : 0.000
0.20/0.51	#    Success case prop preproc time    : 0.000
0.20/0.51	#    Success case prop encoding time   : 0.000
0.20/0.51	#    Success case prop solver time     : 0.000
0.20/0.51	# Current number of processed clauses  : 11
0.20/0.51	#    Positive orientable unit clauses  : 5
0.20/0.51	#    Positive unorientable unit clauses: 0
0.20/0.51	#    Negative unit clauses             : 3
0.20/0.51	#    Non-unit-clauses                  : 3
0.20/0.51	# Current number of unprocessed clauses: 12
0.20/0.51	# ...number of literals in the above   : 30
0.20/0.51	# Current number of archived formulas  : 0
0.20/0.51	# Current number of archived clauses   : 51
0.20/0.51	# Clause-clause subsumption calls (NU) : 184
0.20/0.51	# Rec. Clause-clause subsumption calls : 169
0.20/0.51	# Non-unit clause-clause subsumptions  : 23
0.20/0.51	# Unit Clause-clause subsumption calls : 28
0.20/0.51	# Rewrite failures with RHS unbound    : 0
0.20/0.51	# BW rewrite match attempts            : 11
0.20/0.51	# BW rewrite match successes           : 3
0.20/0.51	# Condensation attempts                : 76
0.20/0.51	# Condensation successes               : 0
0.20/0.51	# Termbank termtop insertions          : 4363
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.010 s
0.20/0.51	# System time              : 0.003 s
0.20/0.51	# Total time               : 0.013 s
0.20/0.51	# Maximum resident set size: 2160 pages
0.20/0.51	
0.20/0.51	# -------------------------------------------------
0.20/0.51	# User time                : 0.012 s
0.20/0.51	# System time              : 0.007 s
0.20/0.51	# Total time               : 0.019 s
0.20/0.51	# Maximum resident set size: 1780 pages
0.20/0.51	% E---3.1 exiting
0.20/0.51	EOF